Bitonic sorters of minimal depth
نویسندگان
چکیده
منابع مشابه
Bitonic sorters of minimal depth
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 dlog(n)e − blog(n)c.
متن کاملSome Topological Properties of Bitonic Sorters
This paper proves some topological properties of bitonic sorters, which have found applications in constructing, along with banyan networks, internally nonblocking switching fabrics in future broadband networks. The states of all the sorting elements of an N N bitonic sorter are studied for four different input sequences ai i N ; @ =1, bi i N ; @ =1, ci i N ; @ =1, and di i N ; @ =1, where ai...
متن کاملMonomial ideals of minimal depth
Let S be a polynomial algebra over a field. We study classes of monomial ideals (as for example lexsegment ideals) of S having minimal depth. In particular, Stanley’s conjecture holds for these ideals. Also we show that if I is a monomial ideal with Ass(S/I) = {P1, P2, . . . , Ps} and Pi 6⊂ ∑s 1=j 6=i Pj for all i ∈ [s], then Stanley’s conjecture holds for S/
متن کاملThe Bitonic Sorting Network
To establish a lower bound on the parceling number of S n we show that, under certain conditions , the parceling number of a graph is no less than the parceling number of its subgraph. For a directed graph G, G 0 is a convex sub-graph of G if for any directed path t of G whose endpoints are both in G 0 : all the nodes and edges of t are in G 0. Note, for example, that any slice of a dil-graph i...
متن کاملOptimizing Parallel Bitonic Sort
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorting algorithms is Bitonic Sort, which is represented by a sorting network consisting of multiple butterfly stages. This paper studies bitonic sort on modern parallel machines which are relatively coarse grained and cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.01.006